Intrinsic complexity estimates in polynomial optimization
نویسندگان
چکیده
منابع مشابه
Intrinsic complexity estimates in polynomial optimization
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using (s d)O(n) arithmetic operations, where n and s are the numbers of variables and constraints and d is the maximal degree of the polynomials involved. We associate to each of these problems an intrinsic system degree which becomes in wor...
متن کاملA pr 2 01 3 Intrinsic complexity estimates in polynomial optimization 1
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using (s d)O(n) arithmetic operations, where n and s are the numbers of variables and constraints and d is the maximal degree of the polynomials involved. We associate to each of these problems an intrinsic system degree which becomes in wor...
متن کاملComplexity of integer quasiconvex polynomial optimization
We study a particular case of integer polynomial optimization: Minimize a polynomial F̂ on the set of integer points described by an inequality system F1 ≤ 0, . . . , Fs ≤ 0, where F̂ , F1, . . . , Fs are quasiconvex polynomials in n variables with integer coefficients. We design an algorithm solving this problem that belongs to the time-complexity class O(s) · lO(1) · dO(n) · 2O(n 3), where d ≥ ...
متن کاملA Web-Based Bimatrix Game Optimization Model of Polynomial Complexity
The objective of this paper is the description, justification, and web-based implementation of polynomial time algorithms for equilibrium search of Quadratic Bimatrix Games (QBG). An algorithm is proposed combining exact and heuristic parts. The exact part has the Irelevant Fraud (IF) component for cases when an equilibrium exists with no pure strategies. The Direct Search (DS) component finds ...
متن کاملComputational Complexity in Polynomial Algebra
In recent years a number of algorithms have been designed for the "inverse" computational problems of polynomial algebra—factoring polynomials, solving systems of polynomial equations, or systems of polynomial inequalities, and related problems—with running time considerably less than that of the algorithms which were previously known. (For the computational complexity of the "direct" problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2014
ISSN: 0885-064X
DOI: 10.1016/j.jco.2014.02.005